Generalized Open Quantum Walks on Apollonian Networks
نویسندگان
چکیده
منابع مشابه
Generalized Open Quantum Walks on Apollonian Networks
We introduce the model of generalized open quantum walks on networks using the Transition Operation Matrices formalism. We focus our analysis on the mean first passage time and the average return time in Apollonian networks. These results differ significantly from a classical walk on these networks. We show a comparison of the classical and quantum behaviour of walks on these networks.
متن کاملCoherent transport on Apollonian networks and continuous-time quantum walks.
We study the coherent exciton transport on Apollonian networks generated by simple iterative rules. The coherent exciton dynamics is modeled by continuous-time quantum walks and we calculate the transition probabilities between two nodes of the networks. We find that the transport depends on the initial nodes of the excitation. For networks up to the second generation the coherent transport sho...
متن کاملQuantum Walks on Generalized Quadrangles
We study the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of S+(U3), a matrix based on the amplitudes of walks in the quantum walk, distinguishes strongly regular graphs. We probabilistically compute the spectrum of the line intersection graphs of two non-isomorphic generalized quadrangles of orde...
متن کاملOpen Quantum Random Walks
A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogue of classical Markov chains. We explore the “quantum trajectory” point of view on these quantum random walks, that is, we show that measuring the position of the particle after each times...
متن کاملMixing of Quantum Walks on Generalized Hypercubes
We study continuous-time quantum walks on graphs which generalize the hypercube. The only known family of graphs whose quantum walk instantaneously mixes to uniform is the Hamming graphs with small arities. We show that quantum uniform mixing on the hypercube is robust under the addition of perfect matchings but not much else. Our specific results include: • The graph obtained by augmenting the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2015
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0130967